A smallest irregular oriented graph containing a given diregular one
نویسندگان
چکیده
منابع مشابه
The Smallest One-Realization of a Given Set
For any set S of positive integers, a mixed hypergraph H is a realization of S if its feasible set is S, furthermore, H is a one-realization of S if it is a realization of S and each entry of its chromatic spectrum is either 0 or 1. Jiang et al. showed that the minimum number of vertices of a realization of {s, t} with 2 ≤ s ≤ t−2 is 2t−s. Král proved that there exists a one-realization of S wi...
متن کاملThe smallest one-realization of a given set II
Let S be a finite set of positive integers. A mixed hypergraph H is a onerealization of S if its feasible set is S and each entry of its chromatic spectrum is either 0 or 1. In [P. Zhao, K. Diao, Y. Chang and K. Wang, The smallest one-realization of a given set II, Discrete Math. 312 (2012) 2946–2951], we determined the minimum number of vertices of a 3-uniform bi-hypergraph which is a one-real...
متن کاملComplementary cycles containing a fixed arc in diregular bipartite tournaments
Let (x, y) be a specified arc in a k-regular bipartite tournament B. We prove that there exists a cycle C of length four through (x, y) in B such that B-C is hamiltonian.
متن کاملOne-diregular subgraphs in semicomplete multipartite digraphs
The problem of nding necessary and suucient conditions for a semicomplete multipartite digraphs (SMD) to be Hamiltonian, seems to be both very interesting and diicult. In 3] Bang-Jensen, Gutin and Huang proved a suucient condition for a SMD to be Hamiltonian. A strengthening of this condition, shown in this paper, allows us to prove the following three results. We prove that every k-strong SMD ...
متن کاملA characterization of the smallest eigenvalue of a graph
It is well known that the smallest eigenvalue of the adjacency matrix of a connected ¿-regular graph is at least -d and is strictly greater than -d if the graph is not bipartite. More generally, for any connected graph G = (V JE), consider the matrix Q = D + A where D is the diagonal matrix of degrees in the graph G , and A is the adjacency matrix of G . Then Q is positive semi-definite, and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.11.049